Stereo Matching by Hierarchical, Microcanonical Annealing
نویسنده
چکیده
An improved stochastic stereo-matching algorithm is presented. It incorporates two substantial modifications to an earlier version: a new variation of simulated annealing that is faster, simpler, and more controllable than the conventional "heatbath^ version, and a hierarchical, coarse-to-fine-resolution cont ro l structure. The Hamil tonian used in the original model is minimized, but far more efficiently. The basis of microcanonical annealing is the Creutz algor i thm . Unlike its counterpart, the famil iar Metropolis a lgor i thm, the Creutz algori thm simulates a thermally isolated system at equi l ibr ium. The hierarchical control structure, together w i th a Brownian state-transition funct ion, tracks ground states across scale, beginning with small, coarsely coded levels. Results are shown for a 512 x 512 pair w i th 50 pixels of disparity.
منابع مشابه
Stereo vision using a microcanonical mean field annealing neural network
A simple stereo algorithm is presented here to obtain the 3D position of a scene’s object points. The proposed algorithm can obtain an object point’s 3D position by merging the microcanonical mean field annealing network (MCMFA) with the stereo vision system. Comparison with mean field annealing (MFA) or microcanonical simulated annealing (MCSA) reveals that current temperature controls the coo...
متن کاملStereo-correspondence using Gabor logons and neural networks
Stereo-correspondence is the most important issue in stereopsis. Feature extraction and matching are the basic steps involved in the solution of stereocorrespondence problem. This work examines the effectiveness of Gabor Logons as pre-processing technique compared to intensity image. The matching is performed using Hopfield network and Simulated Annealing. Performance of these matching techniqu...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملMicrocanonical Mean Field Annealing: A New Algorithm for Increasing the Convergence Speed of Mean Field Annealing
In this paper, we consider the convergence speed of mean field annealing (MFA). We combine MFA with microcanonical simulation(MCS) method and propose a new algorithm called microcanonical mean field annealing(MCMFA). In the proposed algorithm, cooling speed is controlled by current temperature so that computation in the MFA can be reduced without degradation of performance. In addition, the sol...
متن کاملA Stochastic Approach to Stereo Vision
A stochastic optimization approach to stereo matching is presented. Unlike conventional correlation matching and feature matching, the approach provides a dense array of disparities, eliminating the need for interpolation. First, the stereo matching problem is defined in terms of finding a disparity map that satisfies two competing constraints: (1) matched points should have similar image inten...
متن کامل